visibility-decoration sweep completed. git-svn-id: https://llvm.org/svn/llvm-project/libcxx/trunk@114685 91177308-0d34-0410-b5e6-96231b3b80d8
diff --git a/include/unordered_map b/include/unordered_map index 2dd61a5..3571bfd 100644 --- a/include/unordered_map +++ b/include/unordered_map
@@ -288,11 +288,16 @@ : private _Hash { public: + _LIBCPP_INLINE_VISIBILITY __unordered_map_hasher() : _Hash() {} + _LIBCPP_INLINE_VISIBILITY __unordered_map_hasher(const _Hash& __h) : _Hash(__h) {} + _LIBCPP_INLINE_VISIBILITY const _Hash& hash_function() const {return *this;} + _LIBCPP_INLINE_VISIBILITY size_t operator()(const _Tp& __x) const {return static_cast<const _Hash&>(*this)(__x.first);} + _LIBCPP_INLINE_VISIBILITY size_t operator()(const typename _Tp::first_type& __x) const {return static_cast<const _Hash&>(*this)(__x);} }; @@ -302,11 +307,16 @@ { _Hash __hash_; public: + _LIBCPP_INLINE_VISIBILITY __unordered_map_hasher() : __hash_() {} + _LIBCPP_INLINE_VISIBILITY __unordered_map_hasher(const _Hash& __h) : __hash_(__h) {} + _LIBCPP_INLINE_VISIBILITY const _Hash& hash_function() const {return __hash_;} + _LIBCPP_INLINE_VISIBILITY size_t operator()(const _Tp& __x) const {return __hash_(__x.first);} + _LIBCPP_INLINE_VISIBILITY size_t operator()(const typename _Tp::first_type& __x) const {return __hash_(__x);} }; @@ -316,15 +326,22 @@ : private _Pred { public: + _LIBCPP_INLINE_VISIBILITY __unordered_map_equal() : _Pred() {} + _LIBCPP_INLINE_VISIBILITY __unordered_map_equal(const _Pred& __p) : _Pred(__p) {} + _LIBCPP_INLINE_VISIBILITY const _Pred& key_eq() const {return *this;} + _LIBCPP_INLINE_VISIBILITY bool operator()(const _Tp& __x, const _Tp& __y) const {return static_cast<const _Pred&>(*this)(__x.first, __y.first);} + _LIBCPP_INLINE_VISIBILITY bool operator()(const typename _Tp::first_type& __x, const _Tp& __y) const {return static_cast<const _Pred&>(*this)(__x, __y.first);} + _LIBCPP_INLINE_VISIBILITY bool operator()(const _Tp& __x, const typename _Tp::first_type& __y) const {return static_cast<const _Pred&>(*this)(__x.first, __y);} + _LIBCPP_INLINE_VISIBILITY bool operator()(const typename _Tp::first_type& __x, const typename _Tp::first_type& __y) const {return static_cast<const _Pred&>(*this)(__x, __y);} @@ -335,15 +352,22 @@ { _Pred __pred_; public: + _LIBCPP_INLINE_VISIBILITY __unordered_map_equal() : __pred_() {} + _LIBCPP_INLINE_VISIBILITY __unordered_map_equal(const _Pred& __p) : __pred_(__p) {} + _LIBCPP_INLINE_VISIBILITY const _Pred& key_eq() const {return __pred_;} + _LIBCPP_INLINE_VISIBILITY bool operator()(const _Tp& __x, const _Tp& __y) const {return __pred_(__x.first, __y.first);} + _LIBCPP_INLINE_VISIBILITY bool operator()(const typename _Tp::first_type& __x, const _Tp& __y) const {return __pred_(__x, __y.first);} + _LIBCPP_INLINE_VISIBILITY bool operator()(const _Tp& __x, const typename _Tp::first_type& __y) const {return __pred_(__x.first, __y);} + _LIBCPP_INLINE_VISIBILITY bool operator()(const typename _Tp::first_type& __x, const typename _Tp::first_type& __y) const {return __pred_(__x, __y);} @@ -369,6 +393,7 @@ bool __first_constructed; bool __second_constructed; + _LIBCPP_INLINE_VISIBILITY explicit __hash_map_node_destructor(allocator_type& __na) : __na_(__na), __first_constructed(false), @@ -376,6 +401,7 @@ {} #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES + _LIBCPP_INLINE_VISIBILITY __hash_map_node_destructor(__hash_node_destructor<allocator_type>&& __x) : __na_(__x.__na_), __first_constructed(__x.__value_constructed), @@ -384,6 +410,7 @@ __x.__value_constructed = false; } #else // _LIBCPP_HAS_NO_RVALUE_REFERENCES + _LIBCPP_INLINE_VISIBILITY __hash_map_node_destructor(const __hash_node_destructor<allocator_type>& __x) : __na_(__x.__na_), __first_constructed(__x.__value_constructed), @@ -393,6 +420,7 @@ } #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES + _LIBCPP_INLINE_VISIBILITY void operator()(pointer __p) { if (__second_constructed) @@ -405,7 +433,7 @@ }; template <class _HashIterator> -class __hash_map_iterator +class _LIBCPP_VISIBLE __hash_map_iterator { _HashIterator __i_; @@ -425,14 +453,20 @@ #endif pointer; + _LIBCPP_INLINE_VISIBILITY __hash_map_iterator() {} + _LIBCPP_INLINE_VISIBILITY __hash_map_iterator(_HashIterator __i) : __i_(__i) {} + _LIBCPP_INLINE_VISIBILITY reference operator*() const {return *operator->();} + _LIBCPP_INLINE_VISIBILITY pointer operator->() const {return (pointer)__i_.operator->();} + _LIBCPP_INLINE_VISIBILITY __hash_map_iterator& operator++() {++__i_; return *this;} + _LIBCPP_INLINE_VISIBILITY __hash_map_iterator operator++(int) { __hash_map_iterator __t(*this); @@ -440,20 +474,22 @@ return __t; } - friend bool operator==(const __hash_map_iterator& __x, const __hash_map_iterator& __y) + friend _LIBCPP_INLINE_VISIBILITY + bool operator==(const __hash_map_iterator& __x, const __hash_map_iterator& __y) {return __x.__i_ == __y.__i_;} - friend bool operator!=(const __hash_map_iterator& __x, const __hash_map_iterator& __y) + friend _LIBCPP_INLINE_VISIBILITY + bool operator!=(const __hash_map_iterator& __x, const __hash_map_iterator& __y) {return __x.__i_ != __y.__i_;} - template <class, class, class, class, class> friend class unordered_map; - template <class, class, class, class, class> friend class unordered_multimap; - template <class> friend class __hash_const_iterator; - template <class> friend class __hash_const_local_iterator; - template <class> friend class __hash_map_const_iterator; + template <class, class, class, class, class> friend class _LIBCPP_VISIBLE unordered_map; + template <class, class, class, class, class> friend class _LIBCPP_VISIBLE unordered_multimap; + template <class> friend class _LIBCPP_VISIBLE __hash_const_iterator; + template <class> friend class _LIBCPP_VISIBLE __hash_const_local_iterator; + template <class> friend class _LIBCPP_VISIBLE __hash_map_const_iterator; }; template <class _HashIterator> -class __hash_map_const_iterator +class _LIBCPP_VISIBLE __hash_map_const_iterator { _HashIterator __i_; @@ -473,17 +509,24 @@ #endif pointer; + _LIBCPP_INLINE_VISIBILITY __hash_map_const_iterator() {} + _LIBCPP_INLINE_VISIBILITY __hash_map_const_iterator(_HashIterator __i) : __i_(__i) {} + _LIBCPP_INLINE_VISIBILITY __hash_map_const_iterator( __hash_map_iterator<typename _HashIterator::__non_const_iterator> __i) : __i_(__i.__i_) {} + _LIBCPP_INLINE_VISIBILITY reference operator*() const {return *operator->();} + _LIBCPP_INLINE_VISIBILITY pointer operator->() const {return (pointer)__i_.operator->();} + _LIBCPP_INLINE_VISIBILITY __hash_map_const_iterator& operator++() {++__i_; return *this;} + _LIBCPP_INLINE_VISIBILITY __hash_map_const_iterator operator++(int) { __hash_map_const_iterator __t(*this); @@ -491,20 +534,22 @@ return __t; } - friend bool operator==(const __hash_map_const_iterator& __x, const __hash_map_const_iterator& __y) + friend _LIBCPP_INLINE_VISIBILITY + bool operator==(const __hash_map_const_iterator& __x, const __hash_map_const_iterator& __y) {return __x.__i_ == __y.__i_;} - friend bool operator!=(const __hash_map_const_iterator& __x, const __hash_map_const_iterator& __y) + friend _LIBCPP_INLINE_VISIBILITY + bool operator!=(const __hash_map_const_iterator& __x, const __hash_map_const_iterator& __y) {return __x.__i_ != __y.__i_;} - template <class, class, class, class, class> friend class unordered_map; - template <class, class, class, class, class> friend class unordered_multimap; - template <class> friend class __hash_const_iterator; - template <class> friend class __hash_const_local_iterator; + template <class, class, class, class, class> friend class _LIBCPP_VISIBLE unordered_map; + template <class, class, class, class, class> friend class _LIBCPP_VISIBLE unordered_multimap; + template <class> friend class _LIBCPP_VISIBLE __hash_const_iterator; + template <class> friend class _LIBCPP_VISIBLE __hash_const_local_iterator; }; template <class _Key, class _Tp, class _Hash = hash<_Key>, class _Pred = equal_to<_Key>, class _Alloc = allocator<pair<const _Key, _Tp> > > -class unordered_map +class _LIBCPP_VISIBLE unordered_map { public: // types @@ -553,6 +598,7 @@ typedef __hash_map_iterator<typename __table::local_iterator> local_iterator; typedef __hash_map_const_iterator<typename __table::const_local_iterator> const_local_iterator; + _LIBCPP_INLINE_VISIBILITY unordered_map() {} // = default; explicit unordered_map(size_type __n, const hasher& __hf = hasher(), const key_equal& __eql = key_equal()); @@ -590,26 +636,38 @@ #endif unordered_map& operator=(initializer_list<value_type> __il); + _LIBCPP_INLINE_VISIBILITY allocator_type get_allocator() const {return allocator_type(__table_.__node_alloc());} + _LIBCPP_INLINE_VISIBILITY bool empty() const {return __table_.size() == 0;} + _LIBCPP_INLINE_VISIBILITY size_type size() const {return __table_.size();} + _LIBCPP_INLINE_VISIBILITY size_type max_size() const {return __table_.max_size();} + _LIBCPP_INLINE_VISIBILITY iterator begin() {return __table_.begin();} + _LIBCPP_INLINE_VISIBILITY iterator end() {return __table_.end();} + _LIBCPP_INLINE_VISIBILITY const_iterator begin() const {return __table_.begin();} + _LIBCPP_INLINE_VISIBILITY const_iterator end() const {return __table_.end();} + _LIBCPP_INLINE_VISIBILITY const_iterator cbegin() const {return __table_.begin();} + _LIBCPP_INLINE_VISIBILITY const_iterator cend() const {return __table_.end();} #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES + _LIBCPP_INLINE_VISIBILITY pair<iterator, bool> emplace() {return __table_.__emplace_unique();} template <class _A0, class = typename enable_if<is_convertible<_A0, value_type>::value>::type> + _LIBCPP_INLINE_VISIBILITY pair<iterator, bool> emplace(_A0&& __a0) {return __table_.__emplace_unique(_STD::forward<_A0>(__a0));} @@ -621,11 +679,13 @@ #endif // _LIBCPP_HAS_NO_VARIADICS + _LIBCPP_INLINE_VISIBILITY iterator emplace_hint(const_iterator) {return __table_.__emplace_unique().first;} template <class _A0, class = typename enable_if<is_convertible<_A0, value_type>::value>::type> + _LIBCPP_INLINE_VISIBILITY iterator emplace_hint(const_iterator, _A0&& __a0) {return __table_.__emplace_unique(_STD::forward<_A0>(__a0)).first;} @@ -633,50 +693,68 @@ template <class _A0, class... _Args, class = typename enable_if<is_convertible<_A0, key_type>::value>::type> + _LIBCPP_INLINE_VISIBILITY iterator emplace_hint(const_iterator, _A0&& __a0, _Args&&... __args) {return emplace(_STD::forward<_A0>(__a0), _STD::forward<_Args>(__args)...).first;} #endif // _LIBCPP_HAS_NO_VARIADICS #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES + _LIBCPP_INLINE_VISIBILITY pair<iterator, bool> insert(const value_type& __x) {return __table_.__insert_unique(__x);} #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES template <class _P, class = typename enable_if<is_convertible<_P, value_type>::value>::type> + _LIBCPP_INLINE_VISIBILITY pair<iterator, bool> insert(_P&& __x) {return __table_.__insert_unique(_STD::forward<_P>(__x));} #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES + _LIBCPP_INLINE_VISIBILITY iterator insert(const_iterator, const value_type& __x) {return insert(__x).first;} #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES template <class _P, class = typename enable_if<is_convertible<_P, value_type>::value>::type> + _LIBCPP_INLINE_VISIBILITY iterator insert(const_iterator, _P&& __x) {return insert(_STD::forward<_P>(__x)).first;} #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES template <class _InputIterator> void insert(_InputIterator __first, _InputIterator __last); + _LIBCPP_INLINE_VISIBILITY void insert(initializer_list<value_type> __il) {insert(__il.begin(), __il.end());} + _LIBCPP_INLINE_VISIBILITY iterator erase(const_iterator __p) {return __table_.erase(__p.__i_);} + _LIBCPP_INLINE_VISIBILITY size_type erase(const key_type& __k) {return __table_.__erase_unique(__k);} + _LIBCPP_INLINE_VISIBILITY iterator erase(const_iterator __first, const_iterator __last) {return __table_.erase(__first.__i_, __last.__i_);} + _LIBCPP_INLINE_VISIBILITY void clear() {__table_.clear();} + _LIBCPP_INLINE_VISIBILITY void swap(unordered_map& __u) {__table_.swap(__u.__table_);} + _LIBCPP_INLINE_VISIBILITY hasher hash_function() const {return __table_.hash_function().hash_function();} + _LIBCPP_INLINE_VISIBILITY key_equal key_eq() const {return __table_.key_eq().key_eq();} + _LIBCPP_INLINE_VISIBILITY iterator find(const key_type& __k) {return __table_.find(__k);} + _LIBCPP_INLINE_VISIBILITY const_iterator find(const key_type& __k) const {return __table_.find(__k);} + _LIBCPP_INLINE_VISIBILITY size_type count(const key_type& __k) const {return __table_.__count_unique(__k);} + _LIBCPP_INLINE_VISIBILITY pair<iterator, iterator> equal_range(const key_type& __k) {return __table_.__equal_range_unique(__k);} + _LIBCPP_INLINE_VISIBILITY pair<const_iterator, const_iterator> equal_range(const key_type& __k) const {return __table_.__equal_range_unique(__k);} @@ -688,24 +766,39 @@ mapped_type& at(const key_type& __k); const mapped_type& at(const key_type& __k) const; + _LIBCPP_INLINE_VISIBILITY size_type bucket_count() const {return __table_.bucket_count();} + _LIBCPP_INLINE_VISIBILITY size_type max_bucket_count() const {return __table_.max_bucket_count();} + _LIBCPP_INLINE_VISIBILITY size_type bucket_size(size_type __n) const {return __table_.bucket_size(__n);} + _LIBCPP_INLINE_VISIBILITY size_type bucket(const key_type& __k) const {return __table_.bucket(__k);} + _LIBCPP_INLINE_VISIBILITY local_iterator begin(size_type __n) {return __table_.begin(__n);} + _LIBCPP_INLINE_VISIBILITY local_iterator end(size_type __n) {return __table_.end(__n);} + _LIBCPP_INLINE_VISIBILITY const_local_iterator begin(size_type __n) const {return __table_.cbegin(__n);} + _LIBCPP_INLINE_VISIBILITY const_local_iterator end(size_type __n) const {return __table_.cend(__n);} + _LIBCPP_INLINE_VISIBILITY const_local_iterator cbegin(size_type __n) const {return __table_.cbegin(__n);} + _LIBCPP_INLINE_VISIBILITY const_local_iterator cend(size_type __n) const {return __table_.cend(__n);} + _LIBCPP_INLINE_VISIBILITY float load_factor() const {return __table_.load_factor();} + _LIBCPP_INLINE_VISIBILITY float max_load_factor() const {return __table_.max_load_factor();} + _LIBCPP_INLINE_VISIBILITY void max_load_factor(float __mlf) {__table_.max_load_factor(__mlf);} + _LIBCPP_INLINE_VISIBILITY void rehash(size_type __n) {__table_.rehash(__n);} + _LIBCPP_INLINE_VISIBILITY void reserve(size_type __n) {__table_.reserve(__n);} private: @@ -741,7 +834,7 @@ } template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc> -inline +inline _LIBCPP_INLINE_VISIBILITY unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map( const allocator_type& __a) : __table_(__a) @@ -799,7 +892,7 @@ #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc> -inline +inline _LIBCPP_INLINE_VISIBILITY unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_map( unordered_map&& __u) : __table_(_STD::move(__u.__table_)) @@ -853,7 +946,7 @@ #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc> -inline +inline _LIBCPP_INLINE_VISIBILITY unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator=(unordered_map&& __u) { @@ -864,7 +957,7 @@ #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc> -inline +inline _LIBCPP_INLINE_VISIBILITY unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::operator=( initializer_list<value_type> __il) @@ -950,7 +1043,7 @@ template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc> template <class _InputIterator> -inline +inline _LIBCPP_INLINE_VISIBILITY void unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>::insert(_InputIterator __first, _InputIterator __last) @@ -1014,7 +1107,7 @@ } template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc> -inline +inline _LIBCPP_INLINE_VISIBILITY void swap(unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x, unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y) @@ -1042,7 +1135,7 @@ } template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc> -inline +inline _LIBCPP_INLINE_VISIBILITY bool operator!=(const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __x, const unordered_map<_Key, _Tp, _Hash, _Pred, _Alloc>& __y) @@ -1052,7 +1145,7 @@ template <class _Key, class _Tp, class _Hash = hash<_Key>, class _Pred = equal_to<_Key>, class _Alloc = allocator<pair<const _Key, _Tp> > > -class unordered_multimap +class _LIBCPP_VISIBLE unordered_multimap { public: // types @@ -1099,6 +1192,7 @@ typedef __hash_map_iterator<typename __table::local_iterator> local_iterator; typedef __hash_map_const_iterator<typename __table::const_local_iterator> const_local_iterator; + _LIBCPP_INLINE_VISIBILITY unordered_multimap() {} // = default explicit unordered_multimap(size_type __n, const hasher& __hf = hasher(), const key_equal& __eql = key_equal()); @@ -1137,26 +1231,38 @@ #endif unordered_multimap& operator=(initializer_list<value_type> __il); + _LIBCPP_INLINE_VISIBILITY allocator_type get_allocator() const {return allocator_type(__table_.__node_alloc());} + _LIBCPP_INLINE_VISIBILITY bool empty() const {return __table_.size() == 0;} + _LIBCPP_INLINE_VISIBILITY size_type size() const {return __table_.size();} + _LIBCPP_INLINE_VISIBILITY size_type max_size() const {return __table_.max_size();} + _LIBCPP_INLINE_VISIBILITY iterator begin() {return __table_.begin();} + _LIBCPP_INLINE_VISIBILITY iterator end() {return __table_.end();} + _LIBCPP_INLINE_VISIBILITY const_iterator begin() const {return __table_.begin();} + _LIBCPP_INLINE_VISIBILITY const_iterator end() const {return __table_.end();} + _LIBCPP_INLINE_VISIBILITY const_iterator cbegin() const {return __table_.begin();} + _LIBCPP_INLINE_VISIBILITY const_iterator cend() const {return __table_.end();} #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES + _LIBCPP_INLINE_VISIBILITY iterator emplace() {return __table_.__emplace_multi();} template <class _A0, class = typename enable_if<is_convertible<_A0, value_type>::value>::type> + _LIBCPP_INLINE_VISIBILITY iterator emplace(_A0&& __a0) {return __table_.__emplace_multi(_STD::forward<_A0>(__a0));} @@ -1168,11 +1274,13 @@ #endif // _LIBCPP_HAS_NO_VARIADICS + _LIBCPP_INLINE_VISIBILITY iterator emplace_hint(const_iterator __p) {return __table_.__emplace_hint_multi(__p.__i_);} template <class _A0, class = typename enable_if<is_convertible<_A0, value_type>::value>::type> + _LIBCPP_INLINE_VISIBILITY iterator emplace_hint(const_iterator __p, _A0&& __a0) {return __table_.__emplace_hint_multi(__p.__i_, _STD::forward<_A0>(__a0));} @@ -1183,65 +1291,97 @@ iterator emplace_hint(const_iterator __p, _A0&& __a0, _Args&&... __args); #endif // _LIBCPP_HAS_NO_VARIADICS #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES + _LIBCPP_INLINE_VISIBILITY iterator insert(const value_type& __x) {return __table_.__insert_multi(__x);} #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES template <class _P, class = typename enable_if<is_convertible<_P, value_type>::value>::type> + _LIBCPP_INLINE_VISIBILITY iterator insert(_P&& __x) {return __table_.__insert_multi(_STD::forward<_P>(__x));} #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES + _LIBCPP_INLINE_VISIBILITY iterator insert(const_iterator __p, const value_type& __x) {return __table_.__insert_multi(__p.__i_, __x);} #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES template <class _P, class = typename enable_if<is_convertible<_P, value_type>::value>::type> + _LIBCPP_INLINE_VISIBILITY iterator insert(const_iterator __p, _P&& __x) {return __table_.__insert_multi(__p.__i_, _STD::forward<_P>(__x));} #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES template <class _InputIterator> void insert(_InputIterator __first, _InputIterator __last); + _LIBCPP_INLINE_VISIBILITY void insert(initializer_list<value_type> __il) {insert(__il.begin(), __il.end());} + _LIBCPP_INLINE_VISIBILITY iterator erase(const_iterator __p) {return __table_.erase(__p.__i_);} + _LIBCPP_INLINE_VISIBILITY size_type erase(const key_type& __k) {return __table_.__erase_multi(__k);} + _LIBCPP_INLINE_VISIBILITY iterator erase(const_iterator __first, const_iterator __last) {return __table_.erase(__first.__i_, __last.__i_);} + _LIBCPP_INLINE_VISIBILITY void clear() {__table_.clear();} + _LIBCPP_INLINE_VISIBILITY void swap(unordered_multimap& __u) {__table_.swap(__u.__table_);} + _LIBCPP_INLINE_VISIBILITY hasher hash_function() const {return __table_.hash_function().hash_function();} + _LIBCPP_INLINE_VISIBILITY key_equal key_eq() const {return __table_.key_eq().key_eq();} + _LIBCPP_INLINE_VISIBILITY iterator find(const key_type& __k) {return __table_.find(__k);} + _LIBCPP_INLINE_VISIBILITY const_iterator find(const key_type& __k) const {return __table_.find(__k);} + _LIBCPP_INLINE_VISIBILITY size_type count(const key_type& __k) const {return __table_.__count_multi(__k);} + _LIBCPP_INLINE_VISIBILITY pair<iterator, iterator> equal_range(const key_type& __k) {return __table_.__equal_range_multi(__k);} + _LIBCPP_INLINE_VISIBILITY pair<const_iterator, const_iterator> equal_range(const key_type& __k) const {return __table_.__equal_range_multi(__k);} + _LIBCPP_INLINE_VISIBILITY size_type bucket_count() const {return __table_.bucket_count();} + _LIBCPP_INLINE_VISIBILITY size_type max_bucket_count() const {return __table_.max_bucket_count();} + _LIBCPP_INLINE_VISIBILITY size_type bucket_size(size_type __n) const {return __table_.bucket_size(__n);} + _LIBCPP_INLINE_VISIBILITY size_type bucket(const key_type& __k) const {return __table_.bucket(__k);} + _LIBCPP_INLINE_VISIBILITY local_iterator begin(size_type __n) {return __table_.begin(__n);} + _LIBCPP_INLINE_VISIBILITY local_iterator end(size_type __n) {return __table_.end(__n);} + _LIBCPP_INLINE_VISIBILITY const_local_iterator begin(size_type __n) const {return __table_.cbegin(__n);} + _LIBCPP_INLINE_VISIBILITY const_local_iterator end(size_type __n) const {return __table_.cend(__n);} + _LIBCPP_INLINE_VISIBILITY const_local_iterator cbegin(size_type __n) const {return __table_.cbegin(__n);} + _LIBCPP_INLINE_VISIBILITY const_local_iterator cend(size_type __n) const {return __table_.cend(__n);} + _LIBCPP_INLINE_VISIBILITY float load_factor() const {return __table_.load_factor();} + _LIBCPP_INLINE_VISIBILITY float max_load_factor() const {return __table_.max_load_factor();} + _LIBCPP_INLINE_VISIBILITY void max_load_factor(float __mlf) {__table_.max_load_factor(__mlf);} + _LIBCPP_INLINE_VISIBILITY void rehash(size_type __n) {__table_.rehash(__n);} + _LIBCPP_INLINE_VISIBILITY void reserve(size_type __n) {__table_.reserve(__n);} private: @@ -1303,7 +1443,7 @@ } template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc> -inline +inline _LIBCPP_INLINE_VISIBILITY unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_multimap( const allocator_type& __a) : __table_(__a) @@ -1331,7 +1471,7 @@ #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc> -inline +inline _LIBCPP_INLINE_VISIBILITY unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::unordered_multimap( unordered_multimap&& __u) : __table_(_STD::move(__u.__table_)) @@ -1387,7 +1527,7 @@ #ifndef _LIBCPP_HAS_NO_RVALUE_REFERENCES template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc> -inline +inline _LIBCPP_INLINE_VISIBILITY unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::operator=(unordered_multimap&& __u) { @@ -1398,7 +1538,7 @@ #endif // _LIBCPP_HAS_NO_RVALUE_REFERENCES template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc> -inline +inline _LIBCPP_INLINE_VISIBILITY unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::operator=( initializer_list<value_type> __il) @@ -1483,7 +1623,7 @@ template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc> template <class _InputIterator> -inline +inline _LIBCPP_INLINE_VISIBILITY void unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>::insert(_InputIterator __first, _InputIterator __last) @@ -1493,7 +1633,7 @@ } template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc> -inline +inline _LIBCPP_INLINE_VISIBILITY void swap(unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x, unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y) @@ -1525,7 +1665,7 @@ } template <class _Key, class _Tp, class _Hash, class _Pred, class _Alloc> -inline +inline _LIBCPP_INLINE_VISIBILITY bool operator!=(const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __x, const unordered_multimap<_Key, _Tp, _Hash, _Pred, _Alloc>& __y) 